package sol.leetcode;

import def.TreeNode;

/**
 * Invert Binary Tree
 * Created by lkk on 2016/8/28.
 */
public class Issue226 {
    public TreeNode invertTree(TreeNode root) {
        if (root != null) {
            TreeNode left = invertTree(root.left);
            root.left = invertTree(root.right);
            root.right = left;
        }
        return root;
    }
}
